Termination Proof Script
Consider the TRS R consisting of the rewrite rule
1:
f
(X)
→
g
There are no dependency pairs. Hence the TRS is trivially terminating.
Tyrolean Termination Tool
(0.00 seconds) --- May 4, 2006